Swapping labeled tokens on graphs
نویسندگان
چکیده
منابع مشابه
Swapping Labeled Tokens on Graphs
Consider a puzzle consisting of n tokens on an n-vertex graph, where each token has a distinct starting vertex and a distinct target vertex it wants to reach, and the only allowed transformation is to swap the tokens on adjacent vertices. We prove that every such puzzle is solvable in O(n) token swaps, and thus focus on the problem of minimizing the number of token swaps to reach the target tok...
متن کاملSwapping Colored Tokens on Graphs
We investigate the computational complexity of the following problem. We are given a graph in which each vertex has an initial and a target color. Each pair of adjacent vertices can swap their current colors. Our goal is to perform the minimum number of swaps so that the current and target colors agree at each vertex. When the colors are chosen from {1, 2, . . . , c}, we call this problem c-Col...
متن کاملenergy of binary labeled graphs
let $g$ be a graph with vertex set $v(g)$ and edge set $x(g)$ and consider the set $a={0,1}$. a mapping $l:v(g)longrightarrow a$ is called binary vertex labeling of $g$ and $l(v)$ is called the label of the vertex $v$ under $l$. in this paper we introduce a new kind of graph energy for the binary labeled graph, the labeled graph energy $e_{l}(g)$. it depends on the underlying graph $g$...
متن کاملOn correspondence, line tokens and missing tokens
In this article, the authors expand on some of their previous work on correspondence and propose a system that can correspond in the presence of both point and line tokens, or a mix of them. It can also work if some tokens present in one frame are not present in the other. The proposed algorithm is an amalgamation of reductionist and holist paradigms. We establish that properties which remain i...
متن کاملA note on inverses of labeled graphs
We consider simple labeled graphs, with non-zero labels in a ring. If the adjacency matrix of a labeled graph is invertible, the inverse matrix is a (labeled) adjacency matrix of another graph, called the inverse of the original graph. If the labeling takes place in an ordered ring, then balanced inverses—those with positive products of labels along every cycle—are of interest. We introduce the...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Theoretical Computer Science
سال: 2015
ISSN: 0304-3975
DOI: 10.1016/j.tcs.2015.01.052